A Survey of Program Transformation With Special Reference to Unfold/Fold Style Program Development
نویسنده
چکیده
This paper consists of a survey of current, and past, work on program transformation for the purpose of optimization. We first discuss some of the general methodological frameworks for program modification, such as analogy, explanation based learning, partial evaluation, proof theoretic optimization, and the unfold/fold technique. These frameworks are not mutually exclusive, and the latter, unfold/fold, is certainly the most widely used technique, in various guises, for program transformation. Thus we shall often have occasion to: compare the relative merits of systems that employ the technique in some form, andj compare the unfold/fold systems with those that employ alternative techniques. We also include (and compare with unfold/fold) abrief survey of recent work concerning the use of formal methods for program transformation.
منابع مشابه
Proofs by Program Transformations
Logic program transformation systems are often described as a collection of unfolding, folding and goal replacement transformation rules. Given a program P , a logic program transformation system derives a sequence of programs P = P0; P1; : : : ; PN , such that for all 0 i < N , Pi+1 is obtained from Pi by application of one of the above rules. Logic program transformation systems are usually p...
متن کاملTransformation Management in the Program of development and Innovation in Medical Science Education: A Survey of Experts' Viewpoints
Background and Purpose:The program of development and innovation in medical education with realistic understanding of the current situation of health education, has developed clever strategies for development of health education system. This research has been done to investigate the management status of this program. Method:Thiscross-sectional study was descriptive-analytic.The population were ...
متن کاملA Parameterized Unfold/Fold Transformation Framework for De nite Logic Programs
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0, P1, : : : , Pn, such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding u...
متن کاملA. Pettorossi, M. Proietti SYNTHESIS AND TRANSFORMATION OF LOGIC PROGRAMS USING UNFOLD/FOLD PROOFS R. 457 Giugno 1997
We present a method for proving properties of definite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program P and two goals (that is, conjunctions of atoms) F (X, Y ) and G(X, Z), where X, Y , and Z are pairwise disjoint vectors of variables, the unfold/fold proof method can be used to show that the equivalen...
متن کاملA Parameterized Unfold / FoldTransformation Framework for De niteLogic
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0 , P1 , : : : , Pn , such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for deenite logic programs diier from one another mainly in the kind of folding transformations they permit at each step. Some allow foldin...
متن کامل